Realising Team-Working in the Field: An Agent-based Approach

Multi-agent systems technology is applied to enable co-operation between mobile workers in the field, minimising user intervention and increasing reachability. A component-based approach is taken to simplify the management of deployed co-operation services. A Personal Assistant running on a mobile device is introduced to show how an intelligent and autonomous agent can increase the utility of users during workforce co-operation processes. Finally, a real world trial of the technology by network installation and maintenance engineers in the UK is described. Some technical issues revealed during the trial are discussed, as is the impact of the technology on the business process

mPower: A component-based development framework for multi-agent systems to support business processes

One of the obstacles preventing the widespread adoption of multi-agent systems in industry is the difficulty of implementing heterogeneous interactions among participating agents via asynchronous messages. This difficulty arises from the need to understand how to combine elements of various content languages, ontologies, and interaction protocols in order to construct meaningful and appropriate messages. In this paper mPower, a component-based layered framework for easing the development of multi-agent systems, is described, and the facility for customising the components for reuse in similar domains is explained. The framework builds on the JADE-LEAP platform, which provides a homogeneous layer over diverse operating systems and hardware devices, and allows ubiquitous deployment of applications built on multi-agent systems both in wired and wireless environments. The use of the framework to develop mPowermobile , a multi-agent system to support mobile workforces, is reported

Adaptive use of task assignment models in team-based mobile business processes

Most mobile business processes are executed under uncertain and dynamic working environments. This makes the traditional centralized approach for the management of mobile tasks inappropriate to respond to the changes in working environment quickly as collecting the changing information from geographically distributed workforces in real time is expensive if not impossible. This raises the need of a distributed approach in the management of mobile tasks. This paper proposes a distributed architecture for team-based coordination support for mobile task management. In this architecture, tasks are managed via peer-to-peer style coordination between team members who have better understanding on the changing working environment than a centralised system. The novelty of the design of the architecture is explained by applying it to a real business process in the UK

TeamWorker: An agent-based support system for mobile task execution

Traditional workflow management systems are considered insufficiently flexible to support autonomous job management via close team working. This paper proposes a multi-agent system approach to enhancing existing workflow management systems to enable team-based job management in the field of telecommunications service provision and maintenance. This paper adopts a component-based approach and explains how applications can be developed by customising the generic components provided by a multi-agent systems framework

Delivering knowledge in the field: A telecommunications service provision and maintenance case

This paper proposes a novel approach to providing knowledge management services in a business process wherein field engineers are the main process actors, providing and maintaining telecommunications services. Cooperating multi-agents play a central role for the provision of knowledge management services by integrating heterogeneous systems to collect related knowledge for the execution of mobile tasks. The proposed system is expected to increase both the performance of the mobile workforce and customer satisfaction by supporting and encouraging knowledge sharing

MAS platforms as an enabler of enterprise mobilisation: The state of the art

One of the main application areas for multi-agent systems technology is enterprise mobilization, wherein the main business process actors are nomadic workers. An agent's autonomy, sociality and intelligence are highly prized features when it comes to supporting those mobile workers who are geographically isolated from the main knowledge source (i.e. the corporate Intranet) and are frequently moving from one location to another. Based on experience gained from two field trials of applications (built using for multi-agent systems technology and running on lightweight handheld devices) that support mobile business processes for telecommunications service provisioning and maintenance, this paper proposes desirable metrics for any multi-agent systems platform intended for enterprise mobilisation use. These metrics are then used to compare a number of existing multi-agent systems platforms, and based on the results, this paper identifies some areas for improvement

An Approach to Agent-Based Service Composition and Its Application to Mobile

This paper describes an architecture model for multiagent systems that was developed in the European project LEAP (Lightweight Extensible Agent Platform). Its main feature is a set of generic services that are implemented independently of the agents and can be installed into the agents by the application developer in a flexible way. Moreover, two applications using this architecture model are described that were also developed within the LEAP project. The application domain is the support of mobile, virtual teams for the German automobile club ADAC and for British Telecommunications

Aperiodic String Transducers

Regular string-to-string functions enjoy a nice triple characterization through deterministic two-way transducers (2DFT), streaming string transducers (SST) and MSO definable functions. This result has recently been lifted to FO definable functions, with equivalent representations by means of aperiodic 2DFT and aperiodic 1-bounded SST, extending a well-known result on regular languages. In this paper, we give three direct transformations: i) from 1-bounded SST to 2DFT, ii) from 2DFT to copyless SST, and iii) from k-bounded to 1-bounded SST. We give the complexity of each construction and also prove that they preserve the aperiodicity of transducers. As corollaries, we obtain that FO definable string-to-string functions are equivalent to SST whose transition monoid is finite and aperiodic, and to aperiodic copyless SST

Customer-engineer relationship management for converged ICT service companies

Thanks to the advent of converged communications services (often referred to as ‘triple play’), the next generation Service Engineer will need radically different skills, processes and tools from today’s counterpart. Why? in order to meet the challenges of installing and maintaining services based on multi-vendor software and hardware components in an IP-based network environment. The converged services environment is likely to be ‘smart’ and support flexible and dynamic interoperability between appliances and computing devices. These radical changes in the working environment will inevitably force managers to rethink the role of Service Engineers in relation to customer relationship management. This paper aims to identify requirements for an information system to support converged communications service engineers with regard to customer-engineer relationship management. Furthermore, an architecture for such a system is proposed and how it meets these requirements is discussed

On the Computational Complexity of MapReduce

In this paper we study MapReduce computations from a complexity-theoretic perspective. First, we formulate a uniform version of the MRC model of Karloff et al. (2010). We then show that the class of regular languages, and moreover all of sublogarithmic space, lies in constant round MRC. This result also applies to the MPC model of Andoni et al. (2014). In addition, we prove that, conditioned on a variant of the Exponential Time Hypothesis, there are strict hierarchies within MRC so that increasing the number of rounds or the amount of time per processor increases the power of MRC. To the best of our knowledge we are the first to approach the MapReduce model with complexity-theoretic techniques, and our work lays the foundation for further analysis relating MapReduce to established complexity classes